Multi-Access Coded Caching Schemes From Cross Resolvable Designs

We present a novel caching and coded delivery scheme for multi-access network where multiple users can have access to the same cache (shared cache) caches be accessed by user. This is obtained from resolvable designs satisfying certain conditions which we call cross designs. To able compare different schemes with number of normalize rate served. Based on this per-user-rate show that our performs better than well known Maddah-Ali - Niesen (MaN) recently proposed (“Multi-access caching: gains beyond cache-redundancy” Serbetci, Parrinello Elia) SPE scheme. It shown affine planes are based these MaN large memory size cases. The exact performance also presented. considers only cases product normalized 2, whereas allows choices depending choice design.